Matching orderable and separable hypergraphs
نویسندگان
چکیده
A perfect matching in a hypergraph is set of edges that partition the vertices. We study complexity deciding existence orderable and separable hypergraphs. show class hypergraphs strictly contained Accordingly, we for each fixed k, k-hypergraphs polynomial time doable, but $$k\ge 3$$ , it NP-complete
منابع مشابه
Stochastic Matching in Hypergraphs
We study the stochastic matching problem on k-uniform hypergraphs. In this problem, we are given a hypergraphH on V vertices. With each hyperedge E, we are given a probability pe of its existence i.e. an edge e exists in the hypergraph with probability pe , independent of all other edges. Each edge also has a weight associated with it. Our goal is to construct a matching with maximum expected w...
متن کاملLow Complexity Separable Matching Pursuits
Methods of reducing the complexity of the matching pursuits algorithm with minimal loss of fidelity when coding displaced frame difference (DFD) images in video compression are investigated. A full search using 2D basis functions is used as a benchmark. The use of separable 1D bases greatly reduces the complexity, and significant further reductions are achieved by using only a 1D inner product ...
متن کاملOn the matching polynomial of hypergraphs∗
The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received considerable attention and research. In this paper, we generalize this concept and introduce the matching polynomial of hypergraphs. A recurrence relation of the matching polynomial of a hypergraph is obtained. The exact matching polynomials of some special hypergraphs are given. Further, we discuss t...
متن کاملThe b-Matching Problem in Hypergraphs: Hardness and Approximability
In this paper we analyze the maximum cardinality b-matching problem in l-uniform hypergraphs with respect to the complexity class Max-Snp, where b-matching is defined as follows: for given b ∈ N and a hypergraph H = (V, E) a subset Mb ⊆ E with maximum cardinality is sought so that no vertex is contained in more than b hyperedges of Mb. We show that if the maximum degree of the vertices is bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2022
ISSN: ['1862-4480', '1862-4472']
DOI: https://doi.org/10.1007/s11590-022-01854-0